Tractability Results for the Consecutive-Ones Property with Multiplicity
نویسندگان
چکیده
A binary matrix has the Consecutive-Ones Property (C1P) if its columns can be ordered in such a way that all 1’s in each row are consecutive. We consider here a variant of the C1P where columns can appear multiple times in the ordering. Although the general problem of deciding the C1P with multiplicity is NP-complete, we present here a case of interest in comparative genomics that is tractable.
منابع مشابه
Variants of the Consecutive Ones property: Algorithms, Complexity and Applications in Genomics
The Consecutive Ones property (C1P) is a well studied structural property concerning binary matrices, with important applications in genome assembly. While the original decision problem of detecting C1P matrices is solvable in polynomial time, decision and optimization problems on generalizations of the property are usually intractable. These generalizations are extremely important concepts use...
متن کاملApproximation and fixed-parameter algorithms for consecutive ones submatrix problems
We develop an algorithmically useful refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the NP-hard problem to delete a minimum number of rows or columns from a 0/1-matrix such that the remaining s...
متن کاملOn the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...
متن کاملVariants of the Consecutive-Ones Property Motivated by the Reconstruction of Ancestral Species
The polynomial-time decidable Consecutive-Ones Property (C1P) of binary matrices, formally introduced in 1965 by Fulkerson and Gross [52], has since found applications in many areas. In this thesis, we propose and study several variants of this property that are motivated by the reconstruction of ancestral species. We first propose the Gapped C1P, or the (k,δ )-Consecutive-Ones Property ((k,δ )...
متن کاملApproximability and Parameterized Complexity of Consecutive Ones Submatrix Problems
We develop a refinement of a forbidden submatrix characterization of 0/1-matrices fulfilling the Consecutive Ones Property (C1P). This novel characterization finds applications in new polynomial-time approximation algorithms and fixed-parameter tractability results for the problem to find a maximum-size submatrix of a 0/1-matrix such that the submatrix has the C1P. Moreover, we achieve a proble...
متن کامل